Equivalence Class Subset Algorithm
نویسنده
چکیده
The equivalence class subset algorithm is a powerful tool for solving a wide variety of constraint satisfaction problems and is based on the use of a decision function which has a very high but not perfect accuracy. Perfect accuracy is not required in the decision function as even a suboptimal solution contains valuable information that can be used to help find an optimal solution. In the hardest problems, the decision function can break down leading to a suboptimal solution where there are more equivalence classes than are necessary and which can be viewed as a mixture of good decision and bad decisions. By choosing a subset of the decisions made in reaching a suboptimal solution an iterative technique can lead to an optimal solution, using series of steadily improved suboptimal solutions. The goal is to reach an optimal solution as quickly as possible. Various techniques for choosing the decision subset are evaluated. Keywords—np-complete, complexity, algorithm.
منابع مشابه
Query Learning of Derived Omega-Tree Languages in Polynomial Time
We present the first polynomial time algorithm to learn nontrivial classes of languages of infinite trees. Specifically, our algorithm uses membership and equivalence queries to learn classes of ω-tree languages derived from weak regular ω-word languages in polynomial time. The method is a general polynomial time reduction of learning a class of derived ω-tree languages to learning the underlyi...
متن کاملPartial Observation in Distributed Supervisory Control of Discrete-Event Systems
Distributed supervisory control is a method to synthesize local controllers in discrete-eventsystems with a systematic observation of the plant. Some works were reported on extending this methodby which local controllers are constructed so that observation properties are preserved from monolithic todistributed supervisory control, in an up-down approach. In this paper, we find circumstances in ...
متن کاملFast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Given a graph G we provide dynamic programming algorithms for many locally checkable vertex subset and vertex partitioning problems. Their runtime is polynomial in the number of equivalence classes of problem-specific equivalence relations on subsets of vertices, defined on a given decomposition tree of G. Using these algorithms all these problems become solvable in polynomial time for many wel...
متن کاملDynamic equivalence relation on the fuzzy measure algebras
The main goal of the present paper is to extend classical results from the measure theory and dynamical systems to the fuzzy subset setting. In this paper, the notion of dynamic equivalence relation is introduced and then it is proved that this relation is an equivalence relation. Also, a new metric on the collection of all equivalence classes is introduced and it is proved that this metric is...
متن کاملUniform Characterizations of Polynomial-Query Learnabilities
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustiveness queries, and their weak (or restricted) versions where no counterexample is returned. For each of all possible combinations of these queries, we uniformly give complete characterizations of boolean concept classes ...
متن کامل